backtracking line searchの例文

例文

1. The backtracking line search starts with a large estimate of \ alpha and iteratively shrinks it.
2. The latter is called inexact line search and may be performed in a number of ways, such as a backtracking line search or using the Wolfe conditions.
3. We would typically do a backtracking line search in the search direction ( any line search would be valid, but L-BFGS does not require exact line searches in order to converge ).
4. Thus, the backtracking line search strategy starts with a relatively large step size, and repeatedly shrinks it by a factor \ tau \, \ in \, ( 0, 1 ) until the Armijo Goldstein condition is fulfilled.